Boundary Points Detection Using Adjacent Grid Block Selection (AGBS) kNN-Join Method

نویسندگان

  • Shivendra Tiwari
  • Saroj Kaushik
چکیده

Interpretability, usability, and boundary points detection of the clustering results are of fundamental importance. The cluster boundary detection is important for many real world applications, such as geo-spatial data analysis and point-based computer graphics. In this paper, we have proposed an efficient solution for finding boundary points in multi-dimensional datasets that uses the BORDER [1] method as a foundation which is based on Gorder knearest neighbors (kNN) join [10]. We have proposed an Adjacent Grid Block Selection (AGBS) method to compute the kNN-join of two datasets. Further, the AGBS method has been used for the boundary points detection method named as AGBS-BORDER. It executes AGBS join for each element in the dataset to get the paired (qi, pi) kNN values. The kNN-graphs are generated at the same time while computing the kNN-join of the underlying datasets. The nodes maintain a list of kNN which indicate the outgoing edges of the graph; however the incoming edges denote the Reverse kNN (RkNN) for the corresponding nodes. Finally, threshold filter is applied the node whose number of RkNN is less than the threshold values are marked as the border nodes. We have implemented both the BORDER [1] and AGBS-BORDER methods and tested the same using randomly generated geographical points. The AGBS based boundary computation over performs the existing BORDER method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributed Approach to Continuous Queries with kNN Join Processing in Spatial Telemetric Data Warehouse

This chapter describes realization of distributed approach to continuous queries with kNN join processing in the spatial telemetric data warehouse. Due to dispersion of the developed system, new structural members were distinguished: the mobile object simulator, the kNN join processing service, and the query manager. Distributed tasks communicate using JAVA RMI methods. The kNN queries (k Neare...

متن کامل

Gorder: An Efficient Method for KNN Join Processing

An important but very expensive primitive operation of high-dimensional databases is the KNearest Neighbor (KNN) similarity join. The operation combines each point of one dataset with its KNNs in the other dataset and it provides more meaningful query results than the range similarity join. Such an operation is useful for data mining and similarity search. In this paper, we propose a novel KNN-...

متن کامل

Combining an Angle Criterion with Voxelization and the Flying Voxel Method in Reconstructing Building Models from LiDAR Data

Traditional documentation capabilities of laser scanning technology can be further exploited for urban modelling through the transformation of resulting point clouds into solid models compatible for computational analysis. This paper introduces such a technique through the combination of an angle criterion and voxelization. As part of that, a k-nearest neighbor (kNN) searching algorithm is impl...

متن کامل

Efficient index-based KNN join processing for high-dimensional data

In many advanced database applications (e.g., multimedia databases), data objects are transformed into high-dimensional points and manipulated in high-dimensional space. One of the most important but costly operations is the similarity join that combines similar points from multiple datasets. In this paper, we examine the problem of processing K-nearest neighbor similarity join (KNN join). KNN ...

متن کامل

Adaptive Unstructured Grid Generation Scheme for Solution of the Heat Equation

An adaptive unstructured grid generation scheme is introduced to use finite volume (FV) and finite element (FE) formulation to solve the heat equation with singular boundary conditions. Regular grids could not acheive accurate solution to this problem. The grid generation scheme uses an optimal time complexity frontal method for the automatic generation and delaunay triangulation of the grid po...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012